An ILP Formulation for the Task Graph Scheduling Problem Tailored to Bi-Dimensional Reconfigurable Architectures
نویسندگان
چکیده
منابع مشابه
An ILP Formulation for the Task Graph Scheduling Problem Tailored to Bi-Dimensional Reconfigurable Architectures Citation
The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Recommended by Lionel Torres This work proposes an exact ILP formulation for the task scheduling problem on a 2D dynamically and partially reconfigurable architecture. Our approach takes physical constraints of the target device that is relevant for reconfiguration into account...
متن کاملAn efficient ILP formulation for the single machine scheduling problem
This paper considers the problem of scheduling n jobs on a single machine. A fixed processing time and an execution interval are associated with each job. Preemption is not allowed. On the basis of analytical and numerical dominance conditions, an efficient integer linear programming formulation is proposed for this problem, aiming at minimizing the maximum lateness (Lmax). Experiments have bee...
متن کاملTask Partitioning for the Scheduling on Partially Dynamically Reconfigurable Architectures
1 A program specification (a), the time partitioning schedule (b) and the optimal schedule (c).
متن کاملIts: an Ilp-based Combined Instruction/task Static Scheduling Algorithm
Our combined task and instruction static scheduling algorithm implemented in the COINS compiler uses an Integer Linear Programming model to find a schedule for a program on a symmetric multiprocessor system-on-chip. We compare our work to state of the art approaches and on average we find a speedup as high as 1.49 compared to a static task scheduling approach without instruction scheduling. Dep...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Reconfigurable Computing
سال: 2009
ISSN: 1687-7195,1687-7209
DOI: 10.1155/2009/541067